Pancyclicity of the n-Generalized Prism over Skirted Graphs

نویسندگان

چکیده

A side skirt is a planar rooted tree T, T≠P2, where the root of T vertex degree at least two, and all other vertices except leaves are three. reduced Halin graph or skirted plane G=T∪P, skirt, P path connecting in order determined by embedding T. The structure graphs contains both symmetry asymmetry. For n≥2 Pn=v1v2v3⋯vn as length n−1, we call Cartesian product G Pn, n-generalized prism over G. We have known that Hamiltonian. To support Bondy’s metaconjecture from 1971, show pancyclic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Note: Pancyclicity of the Prism

We show that for every 3-connected cubic graph G, the prism G×K2 has cycles of every even length. Furthermore, if G has a triangle, then G × K2 is pancyclic.

متن کامل

Pancyclicity of 4-connected {claw, generalized bull}-free graphs

A graph G is pancyclic if it contains cycles of each length `, 3 ≤ ` ≤ |V (G)|. The generalized bull B(i, j) is obtained by associating one endpoint of each of the paths Pi+1 and Pj+1 with distinct vertices of a triangle. Gould, Luczak and Pfender [4] showed that if G is a 3-connected {K1,3, B(i, j)}-free graph with i + j = 4 then G is pancyclic. In this paper, we prove that every 4-connected, ...

متن کامل

Radio numbers for generalized prism graphs

A radio labeling is an assignment c : V (G) → N such that every distinct pair of vertices u, v satisfies the inequality d(u, v) + |c(u) − c(v)| ≥ diam(G) + 1. The span of a radio labeling is the maximum value. The radio number of G, rn(G), is the minimum span over all radio labelings of G. Generalized prism graphs, denoted Zn,s, s ≥ 1, n ≥ s, have vertex set {(i, j) | i = 1, 2 and j = 1, . . . ...

متن کامل

Graph product of generalized Cayley graphs over polygroups

 In this paper, we introduce a suitable generalization of Cayley graphs that is defined over polygroups (GCP-graph) and give some examples and properties. Then, we mention a generalization of NEPS that contains some known graph operations and apply to GCP-graphs. Finally, we prove that the product of GCP-graphs is again a GCP-graph.

متن کامل

Pancyclicity of recursive circulant graphs

In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic and bipancyclic.  2002 Elsevier Science B.V. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2022

ISSN: ['0865-4824', '2226-1877']

DOI: https://doi.org/10.3390/sym14040816